Saving a Path and Maximizing Dynamic Contra ow: A Bilevel Programming Approach

An important aspect of evacuation planning is to save human population by sending the people in dangerous areas (sources) safe places (sinks). Optimization models for focus on regulating tra_c ow urban road networks so as maximize number evacuees reaching or minimize time evacuees. Recent studies show that reversing direction usual necessary segments increases and decreases signi_cantly. However, this may block some support towards source. Based network models, we consider problem saving a path from given node source, single-source-single-sink network, bilevel program. With an objective function depending rate chosen, upper level selects lower maximizes dynamic allowing arc reversals resulting within horizon. We discuss solution strategy based replacing corresponding KKT conditions. GANIT J. Bangladesh Math. Soc. 42.1 (2022) 010- 024